Isomorphisms between random graphs
نویسندگان
چکیده
Consider two independent Erdős–Rényi G(N,1/2) graphs. We show that with probability tending to 1 as N→∞, the largest induced isomorphic subgraph has size either ⌊xN−εN⌋ or ⌊xN+εN⌋, where xN=4log2N−2log2log2N−2log2(4/e)+1 and εN=(4log2N)−1/2. Using similar techniques, we also if Γ1 Γ2 are G(n,1/2) random graphs, then contains an copy of high n≤⌊yN−εN⌋ does not contain n>⌊yN+εN⌋, yN=2log2N+1 εN is above.
منابع مشابه
Isomorphisms of P4-graphs
For graphs G and G' with minimum degree is = 3 and satisfying one of two other conditions, we prove that any isomorphism from the P4 -graph P4 (G) to P4 ( G') can be induced by a vertex-isomorphism of G onto G'. We also prove that a connected graph G is isomorphic to its P4 -graph P4 (G) if and only if G is a cycle of length at least 4.
متن کاملP3-isomorphisms for graphs
The P3-graph of a finite simple graph G is the graph whose vertices are the 3-vertex paths of G, with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. In this paper we show that connected finite simple graphs G and H with isomorphic P3-graphs are either isomorphic or part of three exceptional families. We also characterize all isomorphisms between P3-graphs...
متن کاملOn Isomorphisms of Vertex-transitive Graphs
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interesting vertex-transitive graphs are given, including a first example of connected symmetric non-Cayley non-GI-graph. Also, we initiate the study...
متن کاملIsomorphisms of Cayley graphs on nilpotent groups
Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with multiplication by an element of the group.) More generally, we show that if Cay(G1;S1) and Cay(G2;S2) are connected Cayley graphs of finite valency on two nilpot...
متن کاملIsomorphisms of Algebras Associated with Directed Graphs
Given countable directed graphs G and G, we show that the associated tensor algebras T+(G) and T+(G ) are isomorphic as Banach algebras if and only if the graphs G are G are isomorphic. For tensor algebras associated with graphs having no sinks or no sources, the graph forms an invariant for algebraic isomorphisms. We also show that given countable directed graphs G, G, the free semigroupoid al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2023
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2023.01.001